† Corresponding author. E-mail:
In this paper the percolation behavior with a specific concentration of the defects was discussed on the two-dimensional graphene lattice. The percolation threshold is determined by a numerical method with a high degree of accuracy. This method is also suitable for locating the percolation critical point on other crystalline structures. Through investigating the evolution of the largest cluster size and the cluster sizes distribution, we find that under various lattice sizes and concentrations of pentagon-heptagon defects there is no apparent change for the percolation properties in graphene lattice.
Percolation is one of the hot topics in the past decades in statistical physics and probability theory. Many papers have found that percolation theory has realistic meaning.[1–14] Most of models discussed in them have their counterparts in real world. For example, forest fires can be approximated by a stochastic process on a square lattices,[1] in which a square site stands a tree. The percolation theory was also proved to be useful in analysis and discussion of the spread of epidemics,[3,7,15] where a node denotes a person and link denotes the relationship between two persons. The percolation phase transition also models the connectivity from top to bottom of a resistors network, there a bond denotes a resistor. The interesting point is, the previous discussions focus mainly on regular perfect geometrical structures, such as the square lattice, the triangular lattice, the graphene lattice, the simple cubic lattice, the body-centered cubic lattice, and other regular lattices. However, realistic world is not an idealized world, i.e., there are various kind of defects in realistic structure. It must be an interesting thing to make it clear what happens when there are defects in the crystal lattice of solid materials.
For percolation, could one present a model in which the defects can be mimicked? Can the percolation threshold be determined precisely? Could we know cluster size distribution near the threshold? All these are the common interest of Physicists.[1,16] Recently, the authors in Ref. [17] discussed the square and cubic lattices with long range correlated defects. In another work (Ref. [18]), the authors investigated the defect structure and percolation on a sphere. Research in Ref. [19] studied the percolation on a triangular lattice with extended needle-like impurities. The authors in Ref. [20] gave the phase diagram of inhomogeneous percolation with a defect plane, and so on.
The authors in recent works[10,12,21] investigated the percolation properties of the charge transport on graphene or quasi-graphene layers. However, they did not discuss the percolation on imperfect graphene. In fact the charge transport is closely linked to bond-percolation. In this work, we present a method to discuss bond-percolation on imperfect graphene lattice, that is to say, the lattice has any concentration of pentagon–heptagon defects. Generally, a defect in the crystal is produced by the dislocation. The concentration of the defects depends upon the ability of the mobility of the defect in the crystal, and strong mobility is accompanied by a high probability defects. The concentration of defects p may be arbitrary value between 0 and 1. The model, at the concentration value 0 of defects, corresponds to traditional honeycomb lattice. However, at the concentration value 1, it corresponds to a structure completely consisted of pentagon–heptagon pairs. The objective of this paper is to study the percolation on graphene with arbitrary concentration of pentagon-heptagon defects.
This paper is organized as follows. In Section
In a graphene defect, pentagon and heptagon always appear in a pair form. Figure
Let tc denote the percolation threshold of the bond density t, at which an infinite cluster appears. For every value
In order to calculate the threshold, two representative methods are useful. One way is to derive nature of the model by analytical method. This method is not always available. The other way is to calculate tc by numerical method. For an infinite system hard to analyze, one can simulate finite systems on a computer, then to extrapolate the results to infinite system, i.e., taking the thermodynamic limit.
Further, one can use finite-size scaling[22] to analyze the transition property of the percolation. For continuous phase transition, any measurable quantity X near the critical point tc has a power-law form
In the present paper, we use a new sampling technique to calculate the critical point. Let A be the property “There exists a cluster connecting from top of the lattice to the bottom, i.e., a percolating cluster”, and let
In this section, we consider the numerical simulations of graphene lattice with defects. The lattice size is
First of all, we shall confirm the rightness of our method by numerical simulation. To this end, a large number of simulations are made on graphene lattice without defect, i.e., the case of p = 0. Theoretically, for graphene bond-percolation, the critical point tc is
In the following we hope to see two different trends in percolation probabilities. The simulation results (two curves in the middle) are shown in Fig.
Additional simulations are made on various lattice sizes, where densities of bonds are t = 0.649 and t = 0.656. The top line and the bottom line in Fig.
Back to our question for graphene lattice with defects. If defects appear with the probability 1, the lattice consists completely of pentagon–heptagon pairs. For simplicity, we consider a simple structure which is formed by regular permutations of pentagon–heptagon pairs (see Fig.
What about the nature of percolation if the graphene lattice has a small ratio of defects? Since the two critical points discussed above are close to each other, a small ratio of defects in the graphene lattice will have a little affection on percolation properties. The numerical simulations are made when p = 0.5, which is a medium value of concentration 0 and 1. A large number of simulations on various lattice sizes tell us that the corresponding critical point is near to 0.6565, because the percolating probability has two different trends. It tends towards to 1 with increasing lattice size at bond density 0.657. Whereas it tends towards to 0 with increasing lattice size at bond density 0.656. This critical value is approximate to the average of 0.6527 and 0.6595 (the critical values at defect concentrations of 0 and 1). It implies that the concentration of the defects has nearly a linear affection on the percolation critical point.
The relative size of the largest connected cluster, describing the probability of any node to be the member of the largest cluster, is the order parameter in percolation process. One can use order parameter to determine the order of the percolation transition. The cluster size distribution at the critical point also can be used to depict the characteristic of the percolation transition. In this way, a power law distribution is observed in typical continuous phase transition. We compare the evolutions of the largest connected cluster under p = 0 and p = 1. The cluster size distributions at critical point under two concentrations of defects are compared too.
Let
Figure
In addition, the lattice with defects is still a two dimensional geometry structure, so the graphene lattice with or without defects falls into the same universality class.[1]
In this paper, we have studied in detail percolation property on graphene with pentagon-heptagon defects. By new sampling method, we have calculated accurately the percolation threshold of finite lattice, and deduced the percolation threshold of infinite lattice based on the simulation results on finite size lattice for several concentrations of defects. This method can be also used to locate the critical point on other types of lattice. Further, we calculate cluster size distribution and have found that the concentrations of defects has a little affection on percolation properties.
[1] | |
[2] | |
[3] | |
[4] | |
[5] | |
[6] | |
[7] | |
[8] | |
[9] | |
[10] | |
[11] | |
[12] | |
[13] | |
[14] | |
[15] | |
[16] | |
[17] | |
[18] | |
[19] | |
[20] | |
[21] | |
[22] | |
[23] |